Computational geometry - PDFSEARCH.IO - Document Search Engine

Computational geometry
Results: 1031

#	Item
401	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Triangulating and Guarding Realistic Polygons G. Aloupis ∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:26 Art gallery problem Polygon triangulation Monotone polygon Star-shaped polygon Polygon Visibility polygon Binary space partitioning Vertex Computational geometry Geometry Polygons Simple polygon
402	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Polygon Reconstruction from Line Cross-Sections Avishay Sidlesky † Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:58:02 Computational geometry Straight skeleton Polygon Point location Arrangement of lines Geometry Discrete geometry Euclidean plane geometry
403	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Set-Difference Range Queries David Eppstein ∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 Bloom filter Hashing FO Computational geometry Set Range searching Bin Bit array Point location Computing Computer programming Data management
404	Program of the 1st Latin American Theoretical Informatics School Monday April 16, :30-08:40 Registration Add to Reading List Source URL: www.dim.uchile.cl Language: English - Date: 2012-04-08 21:13:26 Geometry Philippe Flajolet Academia Combinatorics Computational geometry Algorithm
405	Finding Intersections of Bichromatic Segments Defined by Points Amr Elmasry∗ Abstract Consider a set of n points in <2 , each colored either red or blue. A line segment defined by two red points is a Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:24:09 Convex hull Algorithm Bentley–Ottmann algorithm Line segment intersection Geometry Computational geometry Mathematics
406	CCCG 2011, Toronto ON, August 10–12, 2011 √ Bichromatic Line Segment Intersection Counting in O(n log n) Time Timothy M. Chan∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 Segment tree Line segment intersection Point location Sweep line algorithm Delaunay triangulation Computational geometry Differential topology Algebraic topology Fiber bundles Geometry Mathematics Binary trees
407	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis J´er´emy Barbay∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:09:03 Mathematical analysis Convex analysis Convex geometry Kirkpatrick–Seidel algorithm Convex hull Convex set Computational geometry Hull Convex function Geometry Convex hull algorithms Mathematics
408	16th Canadian Conference on Computational Geometry, 2004 Transformations and Algorithms for Least Sum of Squares Hypersphere Fitting Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Elementary geometry Mathematical optimization Differential geometry Inversive geometry N-sphere Least squares 3-sphere Stereographic projection Riemann sphere Geometry Spheres Projective geometry
409	Research Statement Darren Strash Institute of Theoretical Informatics Karlsruhe Institute of Technology January 12, 2015 Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2015-01-12 15:52:14 NP-complete problems Algorithm Mathematical logic Graph theory Computational geometry Graph coloring Combinatorics Distributed computing Kurt Mehlhorn Theoretical computer science Mathematics Applied mathematics
410	Limits and Applications of Group Algebras for Parameterized Problems Ioannis Koutis Computer Science Department Carnegie Mellon University Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:56:28 Analysis of algorithms Polynomials Algebraic geometry Commutative algebra Parameterized complexity XTR Kernelization Randomized algorithm Time complexity Theoretical computer science Mathematics Computational complexity theory

UPDATE